Efficient Algorithms for k -Disjoint Paths Problems on DAGs
نویسندگان
چکیده
Given an acyclic directed graph and two distinct nodes s and t, we consider the problem of finding k disjoint paths from s to t satisfying some objective. We consider four objectives, MinMax, Balanced, MinSum-MinMin, and MinSum-MinMax. We use the algorithm by Perl-Shiloach and labelling and scaling techniques to devise an FPTAS for the first three objectives. For the forth one, we propose a general and efficient polynomial-time algorithm.
منابع مشابه
Efficient Algorithms for Measuring the Funnel-likeness of DAGs
Funnels are a new natural subclass of DAGs. Intuitively, a DAG is a funnel if every source-sink path can be uniquely identified by one of its arcs. Funnels are an analog to trees for directed graphs that is more restrictive than DAGs but more expressive than in-/out-trees. Computational problems such as finding vertex-disjoint paths or tracking the origin of memes remain NP-hard on DAGs while o...
متن کاملFinding Minimum Energy Disjoint Paths in Wireless Ad-Hoc Networks
We develop algorithms for finding minimum energy disjoint paths in an all-wireless network, for both the node and link-disjoint cases. Our major results include a novel polynomial time algorithm that optimally solves the minimum energy 2 link-disjoint paths problem, as well as a polynomial time algorithm for the minimum energy k node-disjoint paths problem. In addition, we present efficient heu...
متن کاملComplexity of pairwise shortest path routing in the grid
In parallel and distributed systems many communications take place concurrently. The efficient delivery of all the messages depends on the routing algorithms as well as the underlying interconnection network topology. The grid is a planar network topology that lends itself for efficient VLSI implementation and therefore is of interest for theoretical analysis. Frequently, networks and switches ...
متن کاملEfficient algorithms for minimal disjoint path problems on chordal graphs
Disjoint paths have applications in establishing bottleneck-free communication between processors in a network. The problem of finding minimum delay disjoint paths in a network directly reduces to the problem of finding the minimal disjoint paths in the graph which models the network. Previous results for this problem on chordal graphs were an O(| V | | E |) algorithm for 2 edge disjoint paths ...
متن کاملPolynomial-time algorithms for the Longest Induced Path and Induced Disjoint Paths problems on graphs of bounded mim-widthh
We give the first polynomial-time algorithms on graphs of bounded maximum induced matching width (mim-width) for problems that are not locally checkable. In particular, we give nO(w)-time algorithms on graphs of mim-width at most w, when given a decomposition, for the following problems: Longest Induced Path, Induced Disjoint Paths and H-Induced Topological Minor for fixed H. Our results imply ...
متن کامل